number = int(input(""))
skills = input("").split()
for i in range(len(skills)):
skills[i] = int(skills[i])
skills.sort()
result = 0
j = 0
try:
for i in range(number):
while(j < number and skills[j]-skills[i] <= 5):
j = j + 1
result = max(result, j-i)
print(result)
except Exception as e:
print(e)
input("")#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>a(n);
for (auto& a : a)cin >> a;
sort(a.begin(), a.end());
deque<int>d;
d.push_back(a[0]);
int ans = 1;
for (int i = 1; i < n; i++)
{
while (d.size() && a[i] - d.front() > 5)d.pop_front();
d.push_back(a[i]);
ans = max(int(d.size()), ans);
}
cout << ans;
}292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |